A Relationship between Contex Tree Weighting and General Model Weighting Techniques for Tree Sources
نویسنده
چکیده
This paper explores a relationship between parameters for the context tree weighting and weights for a general model weighting technique. In particular, an algorithm is proposed that approximately computes the parameters from the weights, and a condition under which no error for the approximation occurs is derived. key words: model weighting technique, tree source, context tree weighting.
منابع مشابه
Context-Tree Weighting and Maximizing: Processing Betas
The context-tree weighting method (Willems, Shtarkov, and Tjalkens [1995]) is a sequential universal source coding method that achieves the Rissanen lower bound [1984] for tree sources. The same authors also proposed context-tree maximizing, a two-pass version of the context-tree weighting method [1993]. Later Willems and Tjalkens [1998] described a method based on ratios (betas) of sequence pr...
متن کاملA Context-Tree Branch-Weighting Algorithm
The context-tree weighting algorithm [4] is a universal source coding algorithm for binary tree sources. In [2] the algorithm is modified for byte-oriented tree sources. This paper describes the context-tree branch-weighting algorithm, which can reduce the number of parameters for such sources, without increasing the complexity significantly.
متن کاملPrediction of daily precipitation of Sardasht Station using lazy algorithms and tree models
Due to the heterogeneous distribution of precipitation, predicting its occurrence is one of the primary and basic solutions to prevent possible disasters and damages caused by them. Considering the high amount of precipitation in Sardasht County, the people of this city turning to agriculture in recent years and not using classification models in the studied station, it is necessary to predict ...
متن کاملThe Context Tree Weighting Method : Basic PropertiesFrans
We describe a sequential universal data compression procedure for binary tree sources that performs the \double mixture". Using a context tree, this method weights in an eecient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and stor...
متن کاملThe context-tree weighting method: basic properties
We describe a sequential universal data compression procedure for binary tree sources that performs the " double mixture. " Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and ...
متن کامل